A Parallel Genetic Algorithm for the Geometrically Constrained Site Layout Problem
نویسندگان
چکیده
Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The algorithm is parallelized based on a message passing architecture using parallel search and chromosomes migration. The algorithm is tested on a variety of layout problems to illustrate its performance and many favorable results are reported.
منابع مشابه
A Parallel Genetic Algorithm For The Geometrically Constrained Site Layout Problem With Unequal-Size Facilities
Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the site layout problem with unequal-size and constrained facilities. The problem involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The problem is characterised b...
متن کاملA Tunned-parameter Hybrid Algorithm for Dynamic Facility Layout Problem with Budget Constraint using GA and SAA
A facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. An efficient layout contributes to the overall efficiency of operations. It’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. Consequently, the efficiency of the current layout decreases or is lost and it ...
متن کاملTwo Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملDexterous Workspace Shape and Size Optimization of Tricept Parallel Manipulator
This work intends to deal with the optimal kinematic synthesis problem of Tricept parallel manipulator. Observing that cuboid workspaces are desirable for most machines, we use the concept of effective inscribed cuboid workspace, which reflects requirements on the workspace shape, volume and quality, simultaneously. The effectiveness of a workspace is characterized by the dexterity of the manip...
متن کامل